A broad-coverage parser for German based on defeasible constraints
نویسندگان
چکیده
We present a parser for German that achieves a competitive accuracy on unrestricted input while maintaining a coverage of 100%. By writing well-formedness rules as declarative, defeasible constraints that integrate different sources of linguistic knowledge, very high robustness is achieved against all sorts of language error.
منابع مشابه
Parsing Unrestricted German Text with Defeasible Constraints
We present a parser for German that achieves a competitive accuracy on unrestricted input while maintaining a coverage of 100%. By writing well-formedness rules as declarative, defeasible constraints that integrate different sources of linguistic knowledge, very high robustness is achieved against all sorts of extragrammatical constructions.
متن کاملA Corpus-based Study of the German Recipient Passive
In this paper, we investigate the usage of a non-canonical German passive alternation for ditransitive verbs, the recipient passive, in naturally occuring corpus data. We propose a classifier that predicts the voice of a ditransitive verb based on the contextually determined properties of its arguments. As the recipient passive is a low frequent phenomenon, we first create a special data set fo...
متن کاملA Probabilistic Parser as a Model of Global Processing Difficulty
We present a model of global processing difficulty in human parsing. This model is based on a probabilistic context-free grammar and is trained on a realistic corpus sample. It achieves broad coverage and good parsing accuracy on unseen text, and its predictions are significantly correlated with experimental data on word order preferences in German. The model makes predictions about the differe...
متن کاملConstraining robust constructions for broad-coverage parsing with precision grammars
This paper addresses two problems that commonly arise in parsing with precisionoriented, rule-based models of grammar: lack of speed and lack of robustness. First, we show how we can reduce parsing times by restricting the number of tasks the parser will carry out, based on a generative model of rule applications. Second, we show that a combination of search space restriction and radically over...
متن کاملPRINCIPAR - An Efficient, Broad-coverage, Principle-based Parser
We present an efI]cient, broad-coverage, principle-based parser for English. The parser has been implemented in C++ and runs on SUN Sparcstations with X-windows. It con-rains a lexicon with over 90,000 entries, constructed automatically by applying a set of extraction and conversion rules to entries from machine readable dictionaries.
متن کامل